Geometric Key Establishment

نویسندگان

  • Arkady Berenstein
  • Leon Chernyak
چکیده

We propose a new class of key establishment schemes which are based on geometric generalizations of the classical Diffie-Hellman. The simplest of our schemes – based on the geometry of the unit circle – uses only multiplication of rational numbers by integers and addition of rational numbers in its key creation. Its first computer implementation works significantly faster than all known implementations of Diffie-Hellman. Preliminary estimations show that our schemes are resistant to attacks. This resistance follows the pattern of the discrete logarithm problem and hardness of multidimensional lattice problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...

متن کامل

Global optimization of fractional posynomial geometric programming problems under fuzziness

In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...

متن کامل

Geometric Programming Problem with Trapezoidal Fuzzy Variables

Nowadays Geometric Programming (GP) problem is a very popular problem in many fields. Each type of Fuzzy Geometric Programming (FGP) problem has its own solution. Sometimes we need to use the ranking function to change some part of GP to the linear one. In this paper, first, we propose a method to solve multi-objective geometric programming problem with trapezoidal fuzzy variables; then we use ...

متن کامل

A Location-Adaptive Key Establishment Scheme for Large-Scale Distributed Wireless Sensor Networks

— The establishment of pairwise keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of public-key cryptographic techniques for the resource-constrained platforms of sensor networks and also due to vulnerability of physical captures of sensor nodes by an adversary/enemy. In this paper, we propose a new location-adaptive key establishment...

متن کامل

Public Key-based Session Key Establishment for Hierarchical Sensor Networks

Wireless sensor networks (WSNs) are expected to be utilized by internet of things (IoT) applications/services in various fields in the near future. However, studies on session key establishment between two nodes in WSNs are relatively recent compared to studies on long-term key establishment. This paper proposes a security and efficiency enhanced session key establishment scheme for hierarchica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004